Deletion and Addition Methods for Reduct Construction
نویسندگان
چکیده
This paper extends the former study of reduct construction algorithms by taking an intensive study on two complementary control strategies: the deletion methods and the addition methods. Based on their differences and properties, they can be used to construct different kinds of reducts. The winning reducts of the left-to-right lexical order and the rightto-left lexical order can be constructed by the addition methods and the deletion methods, respectively.
منابع مشابه
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods at two levels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic groups based on the underlying control structures. At a low level, by adopting different heuristics or fitness functions for attribute selection, one is able to derive most of the existing algorithms. The analy...
متن کاملEngineered and construction of pDS132::∆virG as suicide vector for targeted gene deletion of virG from Shigella flexneri 2a in order to generation a live attenuated Shigella vaccine
Background & Objective: Shigella are Gram negative bacteria capable of inducing their entry into non-phagocytic cells via secretion of various effector proteins called invasion plasmid antigens (Ipas). The most important of them is VirG protein. Live attenuated Shigella vaccines have indicated promise in inducing protective immune responses in human clinical trials. In current situation, const...
متن کاملA General Definition of an Attribute Reduct
A reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of a given information table. A general definition of an attribute reduct is presented. Specifically, we discuss the following issues: First, there are a variety of properties that can be observed in an information table. Second, the preservation of a certain property b...
متن کاملDiscernibility matrix simplification for constructing attribute reducts
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works in a similar way to the classical Gaussian elimination method for solving a system of linear equations. Elementary matrix simplification operations are introduced. Each operation transforms a matrix into a simpler form. By applying these operations a finite number of times, one can t...
متن کاملPairwise Cores in Information Systems
A core in information system is a set of attributes globally necessary to distinct objects from different decision classes (i.e., the intersection of all reducts of the information system). A notion of a pairwise core (2-core), which naturally extends the definition of a core into the case of pairs of attributes is presented. Some useful features concerned with the graph representation of pairw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007